Invited Talk: Extensions of Graph Transformation Systems for Timed, Continuous, and Probabilistic Behavior

نویسنده

  • Holger Giese
چکیده

Graph transformation systems can be employed to describe systems with complex structural dynamics which states can be captured by attributed graphs. However, like many other standard computer science models such as automata in their basic form time, continuous behavior, or probabilistic behavior are not supported. In this talk we will report on a number of extensions for graph transformation systems that have been developed that permit to describe also time, continuous behavior, probabilistic behavior, timed probabilistic behavior. Referring to the development of related extensions for automata, we will discuss how these results have been transferred to graph transformation systems. We will discuss furthermore which specific problems had to be resolved to transfer the results to graph transformation systems, which tool support exists, and what are the open challenges for each of these directions 1 / 1 Volume 58 (2013)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Graph Transformation Systems

In the recent years, extensions of graph transformation systems with quantitative properties, such as real-time and stochastic behavior received considerable attention. In this paper, we describe the new quantitative modeling approach of probabilistic graph transformation systems (PGTSs) which incorporate probabilistic behavior into graph transformation systems. Among other applications, PGTSs ...

متن کامل

Model Checking for Probabilistic Timed Systems

Application areas such as multimedia equipment, communication protocols and networks often feature systems which exhibit both probabilistic and timed behaviour. In this paper, we consider analysis of such probabilistic timed systems using the technique of model checking, in which it is veriied automatically whether a system satisses a certain desired property. In order to describe formally prob...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

A Petri-net based modeling tool, for analysis and evaluation of computer systems

Petri net is one of the most popular methods in modeling and evaluation of concurrent and event-based systems. Different tools have been created to support modeling and simulation of different extensions of Petri net in different applications. Each tool supports some extensions and some features. In this work a Petri net based modeling and evaluation tool is presented that not only supports dif...

متن کامل

Verifying Soft Deadlines with Probabilistic Timed Automata

This paper describes work in progess performed as part of an ongoing project aimed at the development of theoretical foundations and model checking algorithms for the verification of soft deadlines in timed systems, that is, properties such as “there is a 90% chance that the message will be delivered within 5 time units”. The research is focussed on the probabilistic timed automata model [11], ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ECEASST

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2013